Cube search, revisited

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cube search, revisited.

Observers can quickly search among shaded cubes for one lit from a unique direction. However, replace the cubes with similar 2-D patterns that do not appear to have a 3-D shape, and search difficulty increases. These results have challenged models of visual search and attention. We demonstrate that cube search displays differ from those with "equivalent" 2-D search items in terms of the informa...

متن کامل

Lambert Cube and Löbell Polyhedron Revisited

The first example of a closed orientable hyperbolic 3-manifold was constructed by F. Löbell in 1931 from eight copies of the right-angled 14-hedron. We consider the family of hyperbolic polyhedra which generalize the Lambert cube and the Löbell polyhedron. For polyhedra from this family we give trigonometric relations between essential dihedral angles and lengths and obtain volume formulae in v...

متن کامل

Cube Pruning as Heuristic Search

Cube pruning is a fast inexact method for generating the items of a beam decoder. In this paper, we show that cube pruning is essentially equivalent to A* search on a specific search space with specific heuristics. We use this insight to develop faster and exact variants of cube pruning.

متن کامل

Dynamic Interpolation Search Revisited

A new dynamic Interpolation Search (IS) data structure is presented that achieves O(log log n) search time with high probability on unknown continuous or even discrete input distributions with measurable probability of key collisions, including power law and Binomial distributions. No such previous result holds for IS when the probability of key collisions is measurable. Moreover, our data stru...

متن کامل

Digital Search Trees Revisited

Several algorithms have been proposed which build search trees using digital properties of the search keys. A general approach to the study of the average case performance of such algorithms is discussed, with particular attention to the analysis of the digital search tree structures of Coffman and Eve. Specifically, the method leads to the solution of a problem left open by Knuth, finding the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Vision

سال: 2015

ISSN: 1534-7362

DOI: 10.1167/15.3.9